Massachusetts Institute of Technology Lecturer : Michel X . Goemans

نویسندگان

  • Michel X. Goemans
  • Michel Goemans
  • Michael Manapat
چکیده

The aim of this lecture is to outline the gluing of embeddings at different scales described in James Lee’s paper Distance scales, embeddings, and metrics of negative type from SODA 2005 [1]. We begin by recalling some definitions. A map f : X → Y of metric spaces (X, dX ) and (Y, dY ) is said to be C-Lipschitz if dY (f(x), f(y)) ≤ CdX(x, y) for all x, y ∈ X. The infimum of all C such that f is C-Lipschitz is denoted by ‖f‖Lip. If f is bijective and ‖f‖Lip is finite, we say that f is bi-Lipschitz. The distortion of a bi-Lipschitz map is defined to be ‖f‖Lip‖f‖Lip. If f : X → Y is a 1-Lipschitz map such that for all x, y ∈ X satisfying τ ≤ dX(x, y) ≤ 2τ we have dY (f(x), f(y)) ≥ τ K ,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massachusetts Institute of Technology Lecturer : Michel X . Goemans 18 . 409 : Topics in TCS : Embeddings of Finite Metric Spaces

Recall that a series-parallel graph consists of an edge, or of two series-parallel graphs connected in series or in parallel. A graph can be decomposed into series-parallel blocks if and only if it has treewidth 2. It is easy to see that these graphs cannot, in general, be embedded isometrically into `1: consider, for example, the n-cycle. In this lecture, we shall show two different constant-d...

متن کامل

Massachusetts Institute of Technology Michel X . Goemans 18 . 409 : Topics in TCS : Embeddings of Finite Metric Spaces

We will show how to obtain embeddings into `p with small dimension where all but an -fraction of the embedded distances have small distortion. This result has various applications in networking. The embedding is achieved by randomly choosing a small set of beacons, constructing a good embedding for these nodes (using, e.g., Borgain’s embedding), and then extending this embedding to the remainin...

متن کامل

Probability Theory Lecturer : Michel Goemans

To treat probability rigorously, we define a sample space S whose elements are the possible outcomes of some process or experiment. For example, the sample space might be the outcomes of the roll of a die, or flips of a coin. To each element x of the sample space, we assign a probability, which will be a non-negative number between 0 and 1, which we will denote by p(x). We require that p(x) = ...

متن کامل

Lectures 9 and 10 Lecturer : Michel

1 Semidefinite programming Let Sn×n be the set of n by n real symmetric matrices. Definition 1 A ∈ Sn×n is called positive semidefinite, denoted A 0, if xAx ≥ 0 for any x ∈ R. There are several well-known equivalent ways to state positive semidefiniteness. Proposition 1 The following are equivalent: (i) A is positive semidefinite. (ii) Every eigenvalue of A is nonnegative. (iii) There is a matr...

متن کامل

Generating Functions Lecturer : Michel Goemans

We are going to discuss enumeration problems, and how to solve them using a powerful tool: generating functions. What is an enumeration problem? That’s trying to determine the number of objects of size n satisfying a certain definition. For instance, what is the number of permutations of {1, 2, . . . , n}? (answer: n!), or what is the number of binary sequences of length n? (answer: 2n). Ok, no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006